Solubility of Matrix Inequalities

نویسنده

  • A. N. Churilov
چکیده

An important part is played in the theory of control by special matrix equations [i], and also by the matrix inequalities associated with them. The solutions of these equations or inequalities allow us to construct Lyapunov functions for nonlinear systems of automatic regulation, and to solve problems of the synthesis of optimal control with quadratic quality criterion. Convenient and effectively verifiable conditions for the solubility of Lur'e's inequalities are given by the proposition known as the frequency theorem or the Yakubovich-Kalman Lemma, different variants of whose proof may be found in [2-8]. Beginning with Kalman's work [3], the formulation of the frequency theorem in the often-occurring singular case contains requirements of controllability and observability of the linear part of the system, Although for systems with one nonlinearity these requirements are quite natural, and their verification does not present any special difficulties, for systems with several nonlinearities this verification can be extremely complicated (see Sec. 1.2 of [6] and Sec. 5.6 of [9]). Therefore other mathematicians have tried to completely remove, alter or weaken the requirements of controllability and observability in the formulation of the frequency theorem in the degenerate case. The first and most important result is that of Meyer [i0, ii] (which refers to systems with stable linear part and one nonlinearity). A generalization is introduced (without proof) in [12] of a result of Meyer to the case of several nonlinearities. However an extra restriction on the coefficients of the system is introduced. Another close result connected with the removal of the observ~bility condition was obtained in [13]. In this article we show that the conditions of controllability and observability may in practice be omitted for systems with several nonlinearities and a linear part which is not necessarily stable, i.e. for systems of a substantially wider class than that considered in [10-13].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Singular value inequalities for positive semidefinite matrices

In this note‎, ‎we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique‎. ‎Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl‎. ‎308 (2000) 203-211] and [Linear Algebra Appl‎. ‎428 (2008) 2177-2191]‎.

متن کامل

Some inequalities involving lower bounds of operators on weighted sequence spaces by a matrix norm

Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...

متن کامل

On the solving of matrix equation of Sylvester type

A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...

متن کامل

Further inequalities for operator space numerical radius on 2*2 operator ‎matrices

‎We present some inequalities for operator space numerical radius of $2times 2$ block matrices on the matrix space $mathcal{M}_n(X)$‎, ‎when $X$ is a numerical radius operator space‎. ‎These inequalities contain some upper and lower bounds for operator space numerical radius.

متن کامل

Bounds for the Co-PI index of a graph

In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004